Classical capacity per unit cost for quantum channels

On channel capacity per unit cost

Absfracf -Memoryless communicat ion channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The max imum number of bits that can he transmitted reliably through the channel per unit cost is studied. It is shown that if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the max imum normalized diverge...

Variations On Channel Capacity per Unit Cost

Quantum Channel Capacities Per Unit Cost

Communication over a noisy channel is often conducted in a setting in which different input symbols to the channel incur a certain cost. For example, for the additive white Gaussian noise channel, the cost associated with a real number input symbol is the square of its magnitude. In such a setting, it is often useful to know the maximum amount of information that can be reliably transmitted per...

Capacity and Reliability Function per Unit Cost for Wssus Fading Channels

This paper summaries our recent work on the application of the concepts of capacity per unit cost and reliability function per unit cost to models of fading channels. The cost is taken to be the energy, or a certain fourth moment functional that is sensitive to the bursti-ness of the signals, and is related to the ambiguity function of the input signal. The channel is assumed to be a Wide-Sense...

Classical Capacity of Quantum Binary Adder Channels

We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well–studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the general theory of quantum multiple access channels, and we may apply the established formulas for the capacity region to it. However, the binary adder chann...